Peer-to-Peer Result Dissemination in High-Volume Data Filtering

نویسندگان

  • Paul Burstein
  • Shariq Rizvi
چکیده

Data filtering is the problem of matching high-volume document streams, against a set of client profiles, often represented by queries. Recent work in highvolume data filtering, like the YFilter project at Berkeley, has focused on efficiently indexing client queries, by exploiting the similarity between queries. However, the problem of result dissemination in data filtering has not been received enough attention. Each filtered document has to be delivered to a unique, and typically large set of clients, making this a problem of highly dynamic multicast. We observe fundamental limitations in the client-server delivery model for the high-volume data filtering problem and describe a peer-to-peer scheme to solve it. It exploits the bandwidths of participating clients for data dissemination by building an unstructured overlay network. Our deployment on the PlanetLab testbed shows that the approach proposed is scalable and offers acceptable delivery delays and network economy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Trust-based Approach for Secure Data Dissemination in a Mobile Peer-to-Peer Network of AVs

Mobile peer-to-peer networks of aerial vehicles (AVs) have become significant in collaborative tasks including military missions and search and rescue operations. However, the nature of the communication between the nodes in these networks makes the disseminated data prone to interception by malicious parties, which could cause serious harm for the designated mission of the network. In this pap...

متن کامل

University of California Riverside Adaptive Data Dissemination and Content-driven Routing in Peer-to-peer Systems Iv Abstract of the Thesis Adaptive Data Dissemination and Content-driven Routing in Peer-to-peer Systems

OF THE THESIS Adaptive Data Dissemination and Content-Driven Routing in Peer-to-Peer Systems by Thomas S. Repantis Master of Science, Graduate Program in Computer Science University of California, Riverside, August 2005 Dr. Vana Kalogeraki, Chairperson Peer-to-Peer systems have emerged as a cost-effective means of sharing data and services and are offering fault-tolerance and self-adaptation in...

متن کامل

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Peer-to-Peer Agent Systems for Textual Information Dissemination: Algorithms and Complexity

We discuss the modelsWP andAWP especially designed for the selective dissemination of textual information by peer-to-peer agent systems. We briefly present the syntax and semantics of these models and concentrate on the complexity of query satisfiability, satisfaction, filtering and entailment (these four problems arise naturally in the intended application domain). Finally we discuss an effici...

متن کامل

pFilter: Global Information Filtering and Dissemination Using Structured Overlay Networks

The exponential data growth rate of the Internet makes it increasingly difficult for people to find desired information in a timely fashion. Information filtering and dissemination systems allow users to register persistent queries called user profiles, and notify users when relevant files become available. Existing such systems, however, either are not scalable, or do not support matching of u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003